On the existence of balanced generalized de Bruijn sequences
نویسندگان
چکیده
A balanced generalized de Bruijn sequence with parameters (n,l,k) is a cyclic of n bits such that (a) the number 0's equals 1's, and (b) each substring length l occurs at most k times. We determine necessary sufficient conditions on n,l, for existence sequence.
منابع مشابه
On extending de Bruijn sequences
An indirect proof of part of Theorem 1 was first given by Leach in [11] with a topological and measure-theoretic argument on the set of real numbers corresponding to limits of frequency distribution sequences. In [7] Flaxman et al. use the graph-theoretical characterization of de Bruijn sequences to show that the extensions always exist in alphabets with at least three symbols. However, their p...
متن کاملDe Bruijn Sequences Revisited
A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to different settings: the multi-shift de Bruijn sequence and the pseudo de Bruijn sequence. An m-shift de Bruijn sequence of order n is a word such that every word of length n appears exactly once in w as a factor that start...
متن کاملGeneralized de Bruijn Cycles
For a set of integers I, we define a q-ary I-cycle to be an assignment of the symbols 1 through q to the integers modulo qn so that every word appears on some translate of I. This definition generalizes that of de Bruijn cycles, and opens up a multitude of questions. We address the existence of such cycles, discuss “reduced” cycles (ones in which the all-zeroes string need not appear), and prov...
متن کاملEnumerating De Bruijn Sequences
A cycle is a sequence taken in a circular order—that is, follows , and are all the same cycle as . Given natural numbers and , a cycle of letters is called a complete cycle [1, 2], or De Bruijn sequence, if subsequences consist of all possible ordered sequences over the alphabet . In 1946, De Bruijn proved [1] (see [2]) that the number of complete cycles, under , is equal to . We propose the ov...
متن کاملDe Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new de Bruijn cycles based on ones of lesser order. This is done by mapping a de Bruijn cycle to several vertex disjoint cycles in a de Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms between de Bruijn digraphs of different orders that allow this construction. These maps generalize the well-known ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113487